Preassigning the shape of projections of convex polytopes

نویسنده

  • David W. Barnette
چکیده

The shape of any facet of a 3-polytope can be preassigned. That is, given any 3-polytope P a facet F of P and a polygon F’ with the same number of sides as F, there is an isomorphic 3-polytope P’ such that F is a facet of P’ and the isomorphism takes F onto F (see [ 21). It is also known that given any simple circuit C in the graph of a 3-polytope P, there is an isomorphic 3-polytope P’ such that an orthogonal projection of P’ will take the corresponding circuit onto the boundary of the projection ([ 1)). Griinbaum has asked if given a circuit C of length n in a 3-polytope P and an n-gon A, there is an isomorphic 3-polytope P’ for which the corresponding circuit projects orthogonally onto A [4]. We shall show that there is not always such a 3-polytope P’.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convex Decomposition And Efficient Shape Representation Using Deformable Convex Polytopes

Decomposition of shapes into (approximate) convex parts is essential for applications such as part-based shape representation, shape matching, and collision detection. In this paper, we propose a novel convex decomposition using a parametric implicit shape model called Disjunctive Normal Shape Model (DNSM). The DNSM is formed as a union of polytopes which themselves are formed by intersections ...

متن کامل

Bregman Projections over Submodular Base Polytopes

A well-known computational bottleneck in various first order methods like mirror descent is that of computing a certain Bregman projection. We give a novel algorithm, INC-FIX, for computing these projections under separable mirror maps and more generally for minimizing separable convex functions over submodular base polytopes. For minimizing divergences onto cardinality-based submodular base po...

متن کامل

Amalgamation of Regular Incidence-polytopes

We discuss the following problem from the theory of regular incidence-polytopes. Given two regular d-incidence-polytopes 9X and !?2 such that the facets of 0>2 °d the vertex-figures of 0\ are isomorphic to some regular (d l)-incidence-polytope 3C, is there a regular (d +1)incidence-polytope X with facets of type ^ and vertex-figures of type &•?. Such amalgamations X of 0\ and 0*2 along 3iT exis...

متن کامل

Recent Results on Random Polytopes

This is a survey over recent asymptotic results on random polytopes in d-dimensional Euclidean space. Three ways of generating a random polytope are considered: convex hulls of finitely many random points, projections of a fixed highdimensional polytope into a random d-dimensional subspace, intersections of random closed halfspaces. The type of problems for which asymptotic results are describe...

متن کامل

Convex Surface Visualization Using Rational Bi- cubic Function

The rational cubic function with three parameters has been extended to rational bi-cubic function to visualize the shape of regular convex surface data. The rational bi-cubic function involves six parameters in each rectangular patch. Data dependent constraints are derived on four of these parameters to visualize the shape of convex surface data while other two are free to refine the shape of s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 42  شماره 

صفحات  -

تاریخ انتشار 1986